Soft Histograms for Belief Propagation
نویسندگان
چکیده
Belief propagation methods are powerful tools for various problems in computer vision. While most methods assume a discrete set of labels for each node in the graphical model, there has recently been an increased interest in using real-valued labels and continuous probability density functions for such problems. We propose using channel representations (soft histograms) as a new way of moving from discrete to real-valued labels. The soft histograms are related to continuous density functions through the maximum entropy principle, and a complete soft histogram-based belief propagation method is evaluated and compared to hard discretization methods on simulated and real data.
منابع مشابه
From Maximum Entropy to Belief Propagation: An application to Skin Detection
We build a maximum entropy model for skin detection. This model imposes constraints on various marginal distributions. Parameter estimation as well as optimization cannot be tackled without approximations. We propose to use a tree approximation of the pixel lattice. Parameter estimation is then reduced to the estimations of color histograms for neighbor pixels. Moreover, the belief propagation ...
متن کاملHard Decision and Soft Decision Decoding Algorithms for Ldpc and Qc-ldpc Codes
In this paper Hard Decision and Soft Decision decoding techniques for Quasi-Cyclic-Low Density Parity Check (QC-LDPC) code and Low Density Parity Check (LDPC) code is introduced. QC-LDPC code is proposed to reduce the complexity of the Low Density Parity Check code while obtaining the similar performance. The decoding processes of these codes are easy to simplify and implement. The algorithms u...
متن کاملDeriving Schrodinger Equation From A Soft-Decision Iterative Decoding Algorithm
The belief propagation algorithm has been recognized in the information theory community as a soft-decision iterative decoding algorithm. It is the most powerful algorithm found so far for attacking hard optimization problems in channel decoding. Quantum mechanics is the foundation of modern physics with the time-independent Schrödinger equation being one of the most important equations. This p...
متن کاملSoft Bit Decoding of Low Density Parity Check Codes
A novel soft-bit-domain decoding algorithm for low-density parity-check codes is derived as an alternative to belief propagation and min-sum algorithms. A simple approximation analogous to the min-sum approximation is also presented. Simulation results demonstrating the functionality of the algorithm are given both for floating and fixed point representations.
متن کاملIterative Algebraic Soft Decision Decoding of Reed-Solomon Codes
In this paper, we propose an iterative soft decision decoding scheme for Reed Solomon codes with near maximum likelihood performance. The advantage of this decoding algorithm over previously proposed algorithms is its fast convergence in terms of the number of iterations required. This is achieved by combining two powerful soft decision decoding techniques which were previously regarded in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006